Neighborhood Combination for Unconstrained Binary Quadratic Programming
نویسندگان
چکیده
Using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study, we present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms. In this work, we use one-flip and two-flip moves and investigate combined neighborhoods with these two moves within two metaheuristic algorithms. The goal of the analysis is to help understand why and how some neighborhoods can be favorably combined to increase their search power.
منابع مشابه
Neighborhood Combination for Unconstrained Binary Quadratic Problems
We present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms, using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study. The goal of the analysis is to help understand why, when and how some neighborhoods can be favorably combined to increase their search power. Our study investigates combined neighborhoods with two t...
متن کاملHeuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem
We study the Bipartite Unconstrained 0-1 Quadratic Programming Problem (BQP) which is a relaxation of the Unconstrained 0-1 Quadratic Programming Problem (QP). Applications of the BQP include mining discrete patterns from binary data, approximating matrices by rank-one binary matrices, computing cut-norm of a matrix, and solving optimization problems such as maximum weight biclique, bipartite m...
متن کاملA Penalized Quadratic Convex Reformulation Method for Random Quadratic Unconstrained Binary Optimization
The Quadratic Convex Reformulation (QCR) method is used to solve quadratic unconstrained binary optimization problems. In this method, the semidefinite relaxation is used to reformulate it to a convex binary quadratic program which is solved using mixed integer quadratic programming solvers. We extend this method to random quadratic unconstrained binary optimization problems. We develop a Penal...
متن کاملExperiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming
This article reports an experimental analysis on stochastic local search for approximating the Pareto set of bi-objective unconstrained binary quadratic programming problems. First, we investigate two scalarizing strategies that iteratively identify a high-quality solution for a sequence of sub-problems. Each sub-problem is based on a static or adaptive definition of weighted-sum aggregation co...
متن کاملPractical Integer-to-Binary Mapping for Quantum Annealers
Recent advancements in quantum annealing hardware and numerous studies in this area suggests that quantum annealers have the potential to be effective in solving unconstrained binary quadratic programming problems. Naturally, one may desire to expand the application domain of these machines to problems with general discrete variables. In this paper, we explore the possibility of employing quant...
متن کامل